March 28 - Greedy Algorithm as a Mechanism
نویسنده
چکیده
Main result This lecture is based on a result by Brendan Lucier and Alan Borodin [1]. The main result is the following: Theorem 1. If a greedy algorithm is a c-approximation in the optimization version of the problem then, in the game-theoretic version of the problem, it derives a Price of Anarchy of at most c with first price and (c + 1) with second price. Before proving the result, we need to first understand what we really mean with this theorem.
منابع مشابه
S 6840 – Algorithmic Game Theory March 28 , 2012 Lecture 28 : Greedy Algorithm in General Combinatorial Auctions
Recall the definition of a combinatorial auction. Set S of items on sale. n bidders, each bidder i has vi(A) ≥ 0 for any subset A ⊆ S. In the previous lecture, we introduced single-minded valuations vi which meant, each bidder had a desired set Ai and vi(A) = vi if Ai ⊆ A and 0 otherwise. We generalize this assumption for today: we merely assert that vi is a monotone non-decreasing set function...
متن کاملEnergy Efficiency and Reliability in Underwater Wireless Sensor Networks Using Cuckoo Optimizer Algorithm
Energy efficiency and reliability are widely understood to be one of the dominant considerations for Underwater Wireless Sensor Networks (UWSNs). In this paper, in order to maintain energy efficiency and reliability in a UWSN, Cuckoo Optimization Algorithm (COA) is adopted that is a combination of three techniques of geo-routing, multi-path routing, and Duty-Cycle mechanism. In the proposed alg...
متن کاملAn Iterated Greedy Algorithm for Solving the Blocking Flow Shop Scheduling Problem with Total Flow Time Criteria
In this paper, we propose an iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time minimization objective. The steps of this algorithm are designed very efficient. For generating an initial solution, we develop an efficient constructive heuristic by modifying the best known NEH algorithm. Effectiveness of the proposed iterated greedy algorithm is t...
متن کاملAn Iterated Greedy Algorithm for Flexible Flow Lines with Sequence Dependent Setup Times to Minimize Total Weighted Completion Time
This paper explores the flexile flow lines where setup times are sequence- dependent. The optimization criterion is the minimization of total weighted completion time. We propose an iterated greedy algorithm (IGA) to tackle the problem. An experimental evaluation is conducted to evaluate the proposed algorithm and, then, the obtained results of IGA are compared against those of some other exist...
متن کاملA hybrid metaheuristic using fuzzy greedy search operator for combinatorial optimization with specific reference to the travelling salesman problem
We describe a hybrid meta-heuristic algorithm for combinatorial optimization problems with a specific reference to the travelling salesman problem (TSP). The method is a combination of a genetic algorithm (GA) and greedy randomized adaptive search procedure (GRASP). A new adaptive fuzzy a greedy search operator is developed for this hybrid method. Computational experiments using a wide range of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014